SymScal: symbolic multidimensional scaling of interval dissimilarities

Multidimensional scaling aims at reconstructing dissimilaritiesbetween pairs of objects by distances in a low dimensional space.However, in some cases the dissimilarity itself is unknown, but therange of the dissimilarity is given. Such fuzzy data fall in thewider class of symbolic data (Bock and Diday, 2000).Denoeux and Masson (2000) have proposed to model an intervaldissimilarity by a range of the distance defined as the minimum andmaximum distance between two rectangles representing the objects. Inthis paper, we provide a new algorithm called SymScal that is basedon iterative majorization. The advantage is that each iteration isguaranteed to improve the solution until no improvement is possible.In a simulation study, we investigate the quality of thisalgorithm. We discuss the use of SymScal on empirical dissimilarityintervals of sounds.iterative majorization;multidimensional scaling;symbolic data analysis;distance smoothing

SymScal: symbolic multidimensional scaling of interval dissimilarities

Multidimensional scaling aims at reconstructing dissimilarities between pairs of objects by distances in a low dimensional space. However, in some cases the dissimilarity itself is unknown, but the range of the dissimilarity is given. Such fuzzy data fall in the wider class of symbolic data (Bock and Diday, 2000). Denoeux and Masson (2000) have proposed to model an interval dissimilarity by a range of the distance defined as the minimum and maximum distance between two rectangles representing the objects. In this paper, we provide a new algorithm called SymScal that is based on iterative majorization. The advantage is that each iteration is guaranteed to improve the solution until no improvement is possible. In a simulation study, we investigate the quality of this algorithm. We discuss the use of SymScal on empirical dissimilarity intervals of sounds

Constructing quantum games from non-factorizable joint probabilities

A probabilistic framework is developed that gives a unifying perspective on both the classical and the quantum games. We suggest exploiting peculiar probabilities involved in Einstein-Podolsky-Rosen (EPR) experiments to construct quantum games. In our framework a game attains classical interpretation when joint probabilities are factorizable and a quantum game corresponds when these probabilities cannot be factorized. We analyze how non-factorizability changes Nash equilibria in two-player games while considering the games of Prisoner's Dilemma, Stag Hunt, and Chicken. In this framework we find that for the game of Prisoner's Dilemma even non-factorizable EPR joint probabilities cannot be helpful to escape from the classical outcome of the game. For a particular version of the Chicken game, however, we find that the two non-factorizable sets of joint probabilities, that maximally violates the Clauser-Holt-Shimony-Horne (CHSH) sum of correlations, indeed result in new Nash equilibria.Comment: Revised in light of referee's comments, submitted to Physical Review

Discovery of Samarium, Europium, Gadolinium, and Terbium Isotopes

Currently, thirty-four samarium, thirty-four europium, thirty-one gadolinium, and thirty-one terbium isotopes have been observed and the discovery of these isotopes is discussed here. For each isotope a brief synopsis of the first refereed publication, including the production and identification method, is presented.Comment: To be published in At. Data Nucl. Data Table

Quantum Matching Pennies Game

A quantum version of the Matching Pennies (MP) game is proposed that is played using an Einstein-Podolsky-Rosen-Bohm (EPR-Bohm) setting. We construct the quantum game without using the state vectors, while considering only the quantum mechanical joint probabilities relevant to the EPR-Bohm setting. We embed the classical game within the quantum game such that the classical MP game results when the quantum mechanical joint probabilities become factorizable. We report new Nash equilibria in the quantum MP game that emerge when the quantum mechanical joint probabilities maximally violate the Clauser-Horne-Shimony-Holt form of Bell's inequality.Comment: Revised in light of referees' comments, submitted to Journal of the Physical Society of Japan, 14 pages, 1 figur

An Alternative Interpretation of Statistical Mechanics

In this paper I propose an interpretation of classical statistical mechanics that centers on taking seriously the idea that probability measures represent complete states of statistical mechanical systems. I show how this leads naturally to the idea that the stochasticity of statistical mechanics is associated directly with the observables of the theory rather than with the microstates (as traditional accounts would have it). The usual assumption that microstates are representationally significant in the theory is therefore dispensable, a consequence which suggests interesting possibilities for developing non-equilibrium statistical mechanics and investigating inter-theoretic answers to the foundational questions of statistical mechanics

Robot life: simulation and participation in the study of evolution and social behavior.

This paper explores the case of using robots to simulate evolution, in particular the case of Hamilton's Law. The uses of robots raises several questions that this paper seeks to address. The first concerns the role of the robots in biological research: do they simulate something (life, evolution, sociality) or do they participate in something? The second question concerns the physicality of the robots: what difference does embodiment make to the role of the robot in these experiments. Thirdly, how do life, embodiment and social behavior relate in contemporary biology and why is it possible for robots to illuminate this relation? These questions are provoked by a strange similarity that has not been noted before: between the problem of simulation in philosophy of science, and Deleuze's reading of Plato on the relationship of ideas, copies and simulacra

On malfunctioning software

Artefacts do not always do what they are supposed to, due to a variety of reasons, including manufacturing problems, poor maintenance, and normal wear-and-tear. Since software is an artefact, it should be subject to malfunctioning in the same sense in which other artefacts can malfunction. Yet, whether software is on a par with other artefacts when it comes to malfunctioning crucially depends on the abstraction used in the analysis. We distinguish between “negative” and “positive” notions of malfunction. A negative malfunction, or dysfunction, occurs when an artefact token either does not (sometimes) or cannot (ever) do what it is supposed to. A positive malfunction, or misfunction, occurs when an artefact token may do what is supposed to but, at least occasionally, it also yields some unintended and undesirable effects. We argue that software, understood as type, may misfunction in some limited sense, but cannot dysfunction. Accordingly, one should distinguish software from other technical artefacts, in view of their design that makes dysfunction impossible for the former, while possible for the latter